Search results for "Bargaining problem"

showing 4 items of 4 documents

Multi-Resource Management for Multi-Tier Space Information Networks: A Cooperative Game

2019

With the drastic increase of space information network (SIN) traffic and the diversity of network traffic types, the optimal allocation of the scarce network resources is of great significance for optimizing the SIN system capability. In this paper, we propose a multi-resource management method for multi-tier SIN using the cooperative Nash bargaining solution. Since the original problem is a non-convex problem, we firstly make logarithmic transition, and then find a tightest lower bound function to convert the initial problem into a convex one. In order to carry out the optimal bandwidth and power allocation in SIN, we construct a joint bandwidth and power allocation (JBPA) algorithm. Simul…

Bargaining problemMathematical optimizationspace information networkComputer sciencetietoliikennesatelliititresource allocation020302 automobile design & engineering020206 networking & telecommunications02 engineering and technologyFunction (mathematics)Upper and lower boundslangaton tiedonsiirtooptimointi0203 mechanical engineeringConvergence (routing)Nash bargaining solutions0202 electrical engineering electronic engineering information engineeringBandwidth (computing)peliteoriaResource allocationtightest lower bound function2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)
researchProduct

Constrained consensus for bargaining in dynamic coalitional TU games

2011

We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. We assume that the players in the game interact only with their neighbors, where the neighbors may vary over time. The main contributions of the paper are the definition of a robust (coalitional) TU game and the development of a distributed bargaining protocol. We prove the convergence with probability 1 of the bargaining protocol to a random allocation that lies in the core of the robust game under some mild conditions on the players' communication graphs.

Computer Science::Computer Science and Game TheoryMathematical optimizationBargaining problemSequential gameRobustness (computer science)Computer scienceComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryGraph theoryTransferable utilityMathematical economicsGame theoryIEEE Conference on Decision and Control and European Control Conference
researchProduct

Search, Nash bargaining and rule-of-thumb consumers

2011

Abstract This paper analyses the effects of introducing two typical Keynesian features, namely rule-of-thumb (RoT) consumers and consumption habits, into a standard labour market search model. RoT consumers use the margin that hours and wage negotiation provides them to improve their lifetime utility, by narrowing the gap in utility with respect to Ricardian consumers. This margin for intertemporal optimisation has not been studied yet, because this class of restricted agents has been mainly used in models with no equilibrium unemployment. Our approach allows for a deeper study of the effects of shocks on vacancies, unemployment, hours, wages and how they interact. As habits increase, RoT c…

Consumption (economics)Economics and EconometricsBargaining problemGeneral equilibrium theoryTechnology shockmedia_common.quotation_subjectWageRule of thumbMicroeconomicsUnemploymentEconomicsProductivityFinancemedia_commonEuropean Economic Review
researchProduct

Dynamic Coalitional TU Games: Distributed Bargaining among Players' Neighbors

2013

We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. The game differs from other ones in the literature on dynamic, stochastic or interval valued TU games as it combines dynamics of the game with an allocation protocol for the players that dynamically interact with each other. The protocol is an iterative and decentralized algorithm that offers a paradigmatic mathematical description of negotiation and bargaining processes. The first part of the paper contributes to the definition of a robust (coalitional) TU game and the development of a distributed bargaining protoc…

Mathematical optimizationComputer Science::Computer Science and Game TheorySequential gameComputer scienceCombinatorial game theoryExample of a game without a valueFOS: MathematicsSimultaneous gameElectrical and Electronic EngineeringTransferable utilityMathematics - Optimization and ControlGame theoryBondareva–Shapley theoremBargaining problemNon-cooperative gameUtility theoryStochastic gameComputingMilieux_PERSONALCOMPUTINGScreening gameComputer Science ApplicationsBargaining processCore (game theory)Control and Systems EngineeringOptimization and Control (math.OC)Repeated gameSettore MAT/09 - Ricerca OperativaoptimizationMathematical economicsGame theory
researchProduct